Stabbing Polygonal Chains with Rays is Hard to Approximate
نویسندگان
چکیده
We study a geometric hitting set problem involving unirectional rays and curves in the plane. We show that this problem is hard to approximate within a logarithmic factor even when the curves are convex polygonal x-monotone chains. Additionally, it is hard to approximate within a factor of 76 even when the curves are line segments with bounded slopes. Lastly, we demonstrate that the problem is W [2]-complete when the curves are convex polygonal x-monotone chains and is W [1]-hard when the curves are line segments.
منابع مشابه
Approximation Algorithms for Capacitated Rectangle Stabbing
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines that intersect all the rectangles. In this paper we study the capacitated version of this problem in which the input includes an integral capacity for each line. The capacity of a line bounds the number of rectangles ...
متن کاملElimination of Hard-Nonlinearities Destructive Effects in Control Systems Using Approximate Techniques
Many of the physical phenomena, like friction, backlash, drag, and etc., which appear in mechanical systems are inherently nonlinear and have destructive effects on the control systems behavior. Generally, they are modeled by hard nonlinearities. In this paper, two different methods are proposed to cope with the effects of hard nonlinearities which exist in friction various models. Simple inver...
متن کاملConstan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
We provide constant ratio approximation algorithms for two NP-hard problems, the rectangle stabbing problem and the rectilinear partitioning problem. In the rectangle stabbing problem, we are given a set of rectangles in two-dimensional space, with the objective of stabbing all rectangles with the minimum number of lines parallel to the x and y axes. We provide a 2-approximation algorithm, whil...
متن کاملOptimal Algorithms for Stabbing Polygons by Monotone Chains
In this paper we present optimal algorithms to compute monotone stabbers for convex polygons. More precisely, given a set of m convex polygons with n vertices in total we want to stab the polygons with an x-monotone polygonal chain such that each polygon is entered at its leftmost point and departed at its rightmost point. Since such a stabber does not exist in general, we study two related pro...
متن کاملAn approximate model for slug flow heat transfer in channels of arbitrary cross section
In this paper, a novel approximate solution to determine the Nusselt number for thermally developed, slug (low-prandtl), laminar, single phase flow in channels of arbitrary cross section is presented. Using the Saint-Venant principle in torsion of beams, it is shown that the thermally developed Nusselt number for low-prandtl flow is only a function of the geometrical parameters of the channel c...
متن کامل